Ascending auctions : some impossibility results and their resolutions with final price discounts

نویسنده

  • Laurent Lamy
چکیده

When bidders are not substitutes, we show that there is no standard ascending auction that implements a bidder-optimal competitive equilibrium under truthful bidding. Such an impossibility holds also in environments where the Vickrey payoff vector is a competitive equilibrium payoff and is thus stronger than de Vries, Schummer and Vohra’s [On ascending Vickrey auctions for heterogeneous objects, J. Econ. Theory, 132, 95-118] impossibility result with regards to the Vickrey payoff vector under general valuations. Similarly to Mishra and Parkes [Ascending price Vickrey auctions for general valuations, J. Econ. Theory, 132, 335-366], the impossibility can be circumvented by giving price discounts to the bidders from the final vector of prices. Nevertheless, the similarity is misleading: the solution we propose satisfies a minimality information revelation property that fails to be satisfied in any ascending auction that implements the Vickrey payoffs for general valuations. We investigate related issues when strictly positive increments have to be used under general continuous valuations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ascending price Vickrey auctions for general valuations

Ascending price auctions typically involve a single price path with buyers paying their final bid price. Using this traditional definition, no ascending price auction can achieve the Vickrey-Clarke-Groves (VCG) outcome for general private valuations in the combinatorial auction setting. We relax this definition by allowing discounts to buyers from the final price of the auction (or alternativel...

متن کامل

Informational limitations of ascending combinatorial auctions

We study the inherent limitations of natural widely-used classes of ascending combinatorial auctions. Specifically, we show that ascending combinatorial auctions that do not use both non-linear prices and personalized prices can not achieve social efficiency with general bidder valuations. This casts doubt on the performance that can be achieved using the simpler auctions suggested, e.g., by Kw...

متن کامل

Ascending Price Vickrey Auctions Using Primal-Dual Algorithms∗

The direct Vickrey-Clarke-Groves (VCG) mechanism requires solving underlying optimization problems of the main economy and of every “marginal” economy. We show that VCG outcome can be implemented using a competitive equilibrium (CE) of the main economy if and only if that CE price is also a CE price of every marginal economy. We call such a CE price a universal competitive equilibrium (UCE) pri...

متن کامل

A comparison of first price multi-object auctions

We compare multi-object English-type ascending price auctions with first price sealed bid auctions in private values environments with multi-object demands. Special attention is paid to the effect of closing rules on ascending auctions’ outcomes. JEL classification code: C92, D44

متن کامل

Value Construction and Bidding Behavior in Descending and Ascending Auctions

We report two experiments examining how a set of motivational, cognitive and situational factors drives consumers’ value construction and bidding in auctions involving real products. A motivational antecedent, bidder goals (winning the item versus acquiring it at a price consistent with their value) is examined along with two cognitive factors (a) value precision (operationally, the width of a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009